منابع مشابه
Certain Second Order Linear Differential Subordinations
In this present investigation, we obtain some results for certain second order linear differential subordination. We also discuss some applications of our results.
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملFaber polynomial coefficient estimates for bi-univalent functions defined by subordinations
A function is said to be bi-univalent on the open unit disk D if both the function and its inverse are univalent in D. Not much is known about the behavior of the classes of bi-univalent functions let alone about their coefficients. In this paper we use the Faber polynomial expansions to find coefficient estimates for four well-known classes of bi-univalent functions which are defined by subord...
متن کاملDifferential Subordinations for Certain Meromorphically Multivalent Functions Defined by Dziok-Srivastava Operator
and Applied Analysis 3 Corresponding to a function hp α1, . . . , αq; β1, . . . , βs; z defined by hp ( α1, . . . , αq; β1, . . . , βs; z ) z−pqFs ( α1, . . . , αq; β1, . . . , βs; z ) , 1.11 we now consider a linear operator Hp ( α1, . . . , αq; β1, . . . , βs ) : Σ ( p ) −→ Σp, 1.12 defined by means of the Hadamard product or convolution as follows: Hp ( α1, . . . , αq; β1, . . . , βs ) f z :...
متن کاملPolynomial time quantum algorithms for certain bivariate hidden polynomial problems
We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input consists of several level set superpositions, a more difficult version of the problem than the one where the input is given by an oracle. For constant degre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1990
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181073092